Effective Power Series Computations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective power series computations ∗

Let K be an effective field of characteristic zero. An effective tribe is a subset of K[[z1, z2, ...]] =K ∪K[[z1]] ∪K[[z1, z2]] ∪ ··· which is effectively stable under the Kalgebra operations, restricted division, composition, the implicit function theorem, as well as restricted monomial transformations with arbitrary rational exponents. Given an effective tribe with an effective zero test, we ...

متن کامل

Effective Algebraic Power Series

The division algorithm for ideals of algebraic power series satisfying Hironaka’s box condition is shown to be finite when expressed suitably in terms of the defining polynomial codes of the series.

متن کامل

Predicting Zero Coefficients in Formal Power Series Computations

We consider the problem of predicting long sequences of zero coefficients in a power series obtained by multiplication, division or reversion (where all coefficients are integers). We describe efficient randomized algorithms whose probability of error can be controlled by Publisher: Please supply received and accepted dates. the user. A runtime analysis is given and some experimental results ar...

متن کامل

Power computations in time series analyses for traffic safety interventions.

The evaluation of traffic safety interventions or other policies that can affect road safety often requires the collection of administrative time series data, such as monthly motor vehicle collision data that may be difficult and/or expensive to collect. Furthermore, since policy decisions may be based on the results found from the intervention analysis of the policy, it is important to ensure ...

متن کامل

Effective Computations on Sliding Windows

In the streaming model, elements arrive sequentially and can be observed only once. Maintaining statistics and aggregates is an important and nontrivial task in this model. These tasks become even more challenging in the sliding windows model, where statistics must be maintained only over the most recent n elements. In their pioneering paper, Datar et al. [SIAM J. Comput., 31 (2002), pp. 1794–1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations of Computational Mathematics

سال: 2018

ISSN: 1615-3375,1615-3383

DOI: 10.1007/s10208-018-9391-2